Complexity models for incremental computation
نویسندگان
چکیده
منابع مشابه
Complexity Models for Incremental Computation
We present a new complexity theoretic approach to incremental computation. We de ne complexity classes that capture the intuitive notion of incremental e ciency and study their relation to existing complexity classes. We show that problems that have small sequential space complexity also have small incremental time complexity. We show that all common LOGSPACE-complete problems for P are also in...
متن کاملA Complexity Theoretic Approach to Incremental Computation
We present a new complexity theoretic approach to incremental computation. We deene complexity classes that capture the intuitive notion of incremental eeciency and study their relation to existing complexity classes. We show that all common LOGSPACE-complete problems for P are incr-POLYLOGTIME-complete for P. This suggests that non-redundant problems that seem inherently unparallelizable also ...
متن کاملModels of Parallel Computation and Parallel Complexity
This thesis reviews selected topics from the theory of parallel computation. The research begins with a survey of the proposed models of parallel computation. It examines the characteristics of each model and it discusses its use either for theoretical studies, or for practical applications. Subsequently, it employs common simulation techniques to evaluate the computational power of these model...
متن کاملPreface: Algorithms, complexity and models of computation
This Special Issue arises from the conference Theory and Applications of Models of Computation 2007, held at Fudan University, Shanghai in May 2007. Theory and Applications of Models of Computation (TAMC) is an international conference series with an interdisciplinary character, bringing together researchers working in computer science, mathematics and the physical sciences. This interdisciplin...
متن کاملEecient Computation via Incremental Computation
Incremental computation takes advantage of repeated computations on inputs that diier slightly from one another, computing each output eeciently by exploiting the previous output. This paper gives an overview of a general and systematic approach to incrementalization. Given a program f and an operation , the approach yields an incremental program that computes f (x y) eeciently by using the res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90159-7